Efficient Leveled (Multi) Identity-Based Fully Homomorphic Encryption Schemes
نویسندگان
چکیده
منابع مشابه
Bootstrappable Identity-Based Fully Homomorphic Encryption
It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem. However their constructions are not bootstrappable, and as a result...
متن کاملIncorporating Leveled Homomorphic Encryption-based Private Information Retrieval in Federated eID Schemes to Enhance User Privacy
Numerous services are being offered over the Internet and require identification of users as in face-to-face interactions. To simplify the authentication procedure and reduce the need to manage multiple credentials to access services, Electronic Identification (eID) schemes have been introduced. eID schemes commonly involve many service providers (SPs) which provide services, such as online sho...
متن کاملFully Dynamic Multi Target Homomorphic Attribute-Based Encryption
We propose multi target homomorphic attribute-based encryption (MT-HABE) with fully dynamic homomorphic evaluation: it can take as input arbitrary additional ciphertexts during homomorphic computation. In the previousMT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computedwith a fresh ciphertext whose attribute does no...
متن کامل(Leveled) Fully Homomorphic Signatures from Lattices
In a homomorphic signature scheme, given a vector of signatures ~σ corresponding to a dataset of messages ~ μ, there is a public algorithm that allows to derive a signature σ′ for message μ′ = f(~ μ) for any function f . Given the tuple (σ′, μ′, f) anyone can publicly verify the result of the computation of function f . Along with the standard notion of unforgeability for signatures, the securi...
متن کاملFaster Fully Homomorphic Encryption
We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2922685